A Relational Semantics for Ockham’s Modalities

نویسندگان

چکیده

This article aims at providing some extension of the modal square opposition in light Ockham’s account operators. Moreover, we set forth significant remarks on de re–de dicto distinction and operator contingency by means a set-theoretic algebra called numbering semantics. generalization starting from modalities will allow us to take into consideration whether holds water or not, which case it should be changed.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relational Semantics for Modal Logics

Bernd{Holger Schlinglo Institut f ur Informatik, Technische Universitat M unchen, e-mail: [email protected] Wolfgang Heinle Institut f ur angewandte Mathematik, Universitat Bern, e-mail: [email protected] Abstract In this work we survey the connections between modal logic and relation algebra. We compare various modal and relational languages for the speci cation of reac...

متن کامل

Functorial Semantics for Relational Theories

We introduce the concept of Frobenius theory as a generalisation of Lawvere’s functorial semantics approach to categorical universal algebra. Whereas the universe for models of Lawvere theories is the category of sets and functions, or more generally cartesian categories, Frobenius theories take their models in the category of sets and relations, or more generally in cartesian bicategories.

متن کامل

Relational Semantics Through Duality

In this paper we show how the classical duality results extended to a Duality via Truth contribute to development of a relational semantics for various modal-like logics. In particular, we present a Duality via Truth for some classes of information algebras and frames. We also show that the full categorical formulation of classical duality extends to a full Duality via Truth.

متن کامل

Relational Semantics Revisited

We examine in this paper to what extent at domains containing a `bottom' element, domain constructions such as Plotkin's, and special orderings such as the Egli-Milner ordering or the Smyth ordering can be eschewed (i.e., replaced, respectively, by sets, powersets and the subset relation) in the denotational deenition of the relational semantics of (possibly innnitely) nondeterministic sequenti...

متن کامل

Relational Semantics for Databases and Predicate Calculus

The relational data model requires a theory of relations in which tuples are not only many-sorted, but can also have indexes that are not necessarily numerical. In this paper we develop such a theory and define operations on relations that are adequate for database use. The operations are similar to those of Codd’s relational algebra, but differ in being based on a mathematically adequate theor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Axioms

سال: 2023

ISSN: ['2075-1680']

DOI: https://doi.org/10.3390/axioms12050445